Average number of facets per cell in tree-structured vector quantizer partitions

نویسندگان

  • Kenneth Zeger
  • Miriam R. Kantorovitz
چکیده

[51 J. Max, “Quantizing for minimum distortion,” IRE Trans. Inform. Theory, vol. IT-6, pp. 7-12, Jan. 1960. I61 D. K. Sharma, “Design of absolutely optimal quantizers for a wide class of distortion measures,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 693-702, Nov. 1978. [71 X. Wu, “Algorithmic approaches to quantization,” Ph.D. thesis, Univ. of Calgary, 1988. PI -, “Optimal bi-level quantization and its application to multilevel quantization,” IEEE Trans. Inform. Theory, vol. 37, pp. 160-163, Jan. 1991. [91 -, “On convergence of Lloyd’s method I,” IEEE Trans. Inform. Theory, vol. 38, pp. 171-174, Jan. 1992. [101 -, “Efficient algorithms for discrete optimal quantization,” J. Algorithms, vol. 12, no. 4, pp. 663-673, Dec. 1991. WI “Vector quantizer design by constrained global optimization,” G’IEEE Data Compression ConJY ‘92, Mar. 1992, pp. 132-141. VtUECl-lC, Q-l(w) = &l(w)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable-length constrained-storage tree-structured vector quantization

Constrained storage vector quantization, (CSVQ), introduced by Chan and Gersho (1990, 1991) allows for the stagewise design of balanced tree-structured residual vector quantization codebooks with low encoding and storage complexities. On the other hand, it has been established by Makhoul et al. (1985), Riskin et al. (1991), and by Mahesh et al. (see IEEE Trans. Inform. Theory, vol.41, p.917-30,...

متن کامل

Classification and Compression of Multi-Resolution Vectors: A Tree Structured Vector Quantizer Approach

Title of Dissertation: CLASSIFICATION AND COMPRESSION OF MULTIRESOLUTION VECTORS: A TREE STRUCTURED VECTOR QUANTIZER APPROACH Sudhir Varma, Doctor of Philosophy, 2002 Dissertation directed by: Professor John S. Baras Department of Electrical and Computer Engineering Tree structured classifiers and quantizers have been used with good success for problems ranging from successive refinement coding...

متن کامل

Title of Dissertation : CLASSIFICATION AND COMPRESSION OF MULTI - RESOLUTION VECTORS : A TREE STRUCTURED VECTOR QUANTIZER APPROACH

Title of Dissertation: CLASSIFICATION AND COMPRESSION OF MULTIRESOLUTION VECTORS: A TREE STRUCTURED VECTOR QUANTIZER APPROACH Sudhir Varma, Doctor of Philosophy, 2002 Dissertation directed by: Professor John S. Baras Department of Electrical and Computer Engineering Tree structured classifiers and quantizers have been used with good success for problems ranging from successive refinement coding...

متن کامل

A genetic approach to the design of general-tree-structured vector quantizers for speech coding

The full-search vector quantization suffers from spending much time searching the whole codebook sequentially. Rcccntly, several tree-structured vector quantizers had been proposed. But almost all trees used arc binary trees and hence the training samples contained in each node are forced to be divided into two clusters artificially. We present a general-tree-structured vector quantizer that is...

متن کامل

On The Complexity of Optimal Tree Pruning for Source Coding

Tree-structured vector quantization (VQ) is a technique to represent a codebook that simplifies encoding as well as quantizer design. Most design algorithms for tree-structured VQ used in the past are based on heuristics that successively partition the input space. Recently, Chou, Lookabaugh, and Gray proposed a tree pruning heuristic in which a given initial tree is pruned backwards according ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 39  شماره 

صفحات  -

تاریخ انتشار 1993